Comparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes
نویسندگان
چکیده
We consider a multigrid algorithm (MG) for the cell centered finite difference scheme (CCFD) on general triangular meshes using a new prolongation operator. This prolongation is designed to solve the diffusion equation with strongly discontinuous coefficient as well as with smooth one. We compare our new prolongation with the natural injection and the weighted operator in Kwak, Kwon, and Lee (Appl Math Comput 21 (1999), 552–564) and the behaviors of these three prolongation are discussed. Numerical experiments show that (i) for smooth problems, the multigrid with our new prolongation is fastest, the next is the weighted prolongation, and the third is the natural injection; and (ii) for nonsmooth problems, our new prolongation is again fastest, the next is the natural injection, and the third is the weighted prolongation. In conclusion, our new prolongation works better than the natural injection and the weighted operator for both smooth and nonsmooth problems. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 22: 1080–1089, 2006
منابع مشابه
Multigrid algorithm for cell centered finite difference on triangular meshes
We consider a multigrid algorithm for the cell centered dierence scheme on triangular meshes using a new prolongation operator. The energy norm of this prolongation is shown to be less than 2 p . Thus the W-cycle is guaranteed to converge. Numerical experiments show that our operator is better than the trivial injection. Ó 1999 Elsevier Science Inc. All rights reserved. AMS classi®cation: ...
متن کامل48 . V – cycle Multigrid Convergence for Cell Centered Finite Difference Method , 3 - D case
متن کامل
The analysis of multigrid algorithms for cell centered finite difference methods
In this paper, we examine multigrid algorithms for cell centered nite diierence approximations of second order elliptic boundary value problems. The cell centered application gives rise to one of the simplest non-variational multigrid algorithms. We shall provide an analysis which guarantees that the W-cycle and variable V-cycle multigrid algorithms converge with a rate of iterative convergence...
متن کاملMultigrid Algorithm for the Cell-Centered Finite Difference Method II: Discontinuous Coefficient Case
We consider a multigrid algorithm for the cell centered finite difference scheme with a prolongation operator depending on the diffusion coefficient. This prolongation operator is designed mainly for solving diffusion equations with strong varying or discontinuous coefficient and it reduces to the usual bilinear interpolation for Laplace equation. For simple interface problem, we show that the ...
متن کاملUniform convergence of the multigrid V-cycle on graded meshes for corner singularities
This paper analyzes a Multigrid V-cycle scheme for solving the discretized 2D Poisson equation with corner-singularities. Using weighted Sobolev spaces K a (Ω) and a space decomposition based on elliptic projections, we prove that the multigrid V -cycle with standard smoothers (Richardson, weighted Jacobi, Gauss-Seidel, etc.) and piecewise linear interpolation converges uniformly for the linear...
متن کامل